Circular planar graphs and resistor networks
نویسندگان
چکیده
منابع مشابه
Circular planar graphs and resistor networks
We consider circular planar graphs and circular planar resistor networks. Associated with each circular planar graph F there is a set n(F) = { (P; Q) } of pairs of sequences of boundary nodes which are connected through F. A graph F is called critical if removing any edge breaks at least one of the connections (P: Q) in n(F). We prove that two critical circular planar graphs are Y-A equivalent ...
متن کاملCircular Planar Resistor Networks with Nonlinear and Signed Conductors
We consider the inverse boundary value problem in the case of discrete electrical networks containing nonlinear (non-ohmic) resistors. Generalizing work of Curtis, Ingerman, Morrow, Colin de Verdière, Gitler, and Vertigan, we characterize the circular planar graphs for which the inverse boundary value problem has a solution in this generalized non-linear setting. The answer is the same as in th...
متن کاملNovel Relationships Between Circular Planar Graphs and Electrical Networks
Circular planar graphs are used to model electrical networks, which arise in classical physics. Associated with such a network is a network response matrix, which carries information about how the network behaves in response to certain potential differences. Circular planar graphs can be organized into equivalence classes based upon these response matrices. In each equivalence class, certain fu...
متن کاملDrawing Planar Graphs with Circular Arcs
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the area of drawings in which edges are drawn using exactly one circular arc. We also give an algorithm for drawing n-vertex planar graphs such that the edges are sequences of two continuous circular arcs. The algorithm ru...
متن کاملShortest Circular Paths on Planar Graphs
The shortest circular-path problem is similar to the ordinary shortest path problem, but instead of specifying a distinguished starting and end node, the path has to form a closed loop. This problem has several applications in optimization problems as they occur in image segmentation or shape matching. We propose a new algorithm to compute shortest circular paths on planar graphs that has a typ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(98)10087-3